A nonlinear weak constraint enforcement method for advection-dominated diffusion problems
نویسندگان
چکیده
We devise a stabilized method to weakly enforce bound constraints in the discrete solution of advection-dominated diffusion problems. This combines nonlinear penalty formulation with discontinuous Galerkin-based residual minimization method. illustrate efficiency this scheme for both uniform and adaptive meshes through proper numerical examples.
منابع مشابه
Acceleration of a Domain Decomposition Method for Advection-Diffusion Problems
in a bounded polyhedral domain Ω ⊂ R with a Lipschitz boundary ∂Ω and 0 < ǫ ≤ 1,b ∈ [H(Ω) ∩ L∞(Ω)]d, c ∈ L∞(Ω), f ∈ L(Ω), c− 1 2∇ · b ≥ 0. Let {Ωk} be a non-overlapping macro partition with Ω = ∪k=1Ωk. The goal of the well-known DDM of Robin type (Lions [1990]) is to enforce (in appropriate trace spaces) continuity of the solution u and of the diffusive and advective fluxes ǫ∇u·nkj resp.− 1 2 (...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA Simplified Solution for Advection Dominated Accretion Flows with Outflow
The existence of outflow in the advection dominated accretion flows has been confirmed by both numerical simulations and observations. The outow models for ADAF have been investigated by several groups with a simple self similar solution. But this solution is inaccurate at the inner regions and can not explain the emitted spectrum of the flow; so, it is necessary to obtain a global solution for...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملAn hr–adaptive discontinuous Galerkin method for advection–diffusion problems
We propose an adaptive mesh refinement strategy based on exploiting a combination of a pre–processing mesh re-distribution algorithm employing a harmonic mapping technique, and standard (isotropic) mesh subdivision for discontinuous Galerkin approximations of advection–diffusion problems. Numerical experiments indicate that the resulting adaptive strategy can efficiently reduce the computed dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mechanics Research Communications
سال: 2021
ISSN: ['0093-6413', '1873-3972']
DOI: https://doi.org/10.1016/j.mechrescom.2020.103602